Truncated-Newton training algorithm for neurocomputational viscoplastic model
نویسندگان
چکیده
منابع مشابه
Truncated-Newton Training Algorithm for Neurocomputational Viscoplastic Model
We present an estimate approach to compute the viscoplastic behavior of a polymeric composite under different thermomechanical approaches. This investagation incorporates computational neural network as the tool for determining the creep behaviour of the composite. We propose a new second-order learning algorithm for training the multilayer networks. Training in the neural network is generally ...
متن کاملTruncated-Newton Training Algorithm for
We present an estimate approach to compute the viscoplastic behavior of a polymer matrix composite (PMC) under different thermomechanical environments. This investigation incorporates computational neural network as the tool for deter-mining the creep behavior of the composite. We propose a new second-order learning algorithm for training the multilayer networks. Training in the neural network ...
متن کاملA damped Newton algorithm for computing viscoplastic fluid flows
For the first time, a Newton method is proposed for the unregularized viscoplastic fluid flow problem. It leads to a superlinear convergence for Herschel-Bulkley fluids when 0 < n < 1, where n is the power law index. Performances are enhanced by using the inexact variant of the Newton method and, for solving the Jacobian system, by using an efficient preconditioner based on the regularized prob...
متن کاملA Truncated Newton Algorithm for Large Scale Box Constrained Optimization
A new method for the solution of minimization problems with simple bounds is presented. Global convergence of a general scheme requiring the approximate solution of a single linear system at each iteration is proved and a superlinear convergence rate is established without requiring the strict complementarity assumption. The algorithm proposed is based on a simple, smooth unconstrained reformul...
متن کاملTruncated regularized Newton method for convex minimizations
Recently, Li et al. (Comput. Optim. Appl. 26:131–147, 2004) proposed a regularized Newton method for convex minimization problems. The method retains local quadratic convergence property without requirement of the singularity of the Hessian. In this paper, we develop a truncated regularized Newton method and show its global convergence. We also establish a local quadratic convergence theorem fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2003
ISSN: 0045-7825
DOI: 10.1016/s0045-7825(03)00261-5